package com.lihepeng.leecode.linkedList.thematic;

import com.lihepeng.leecode.linkedList.ListNode;


/**
 *
 */
public class Solution876 {
    public ListNode middleNode(ListNode head) {
        ListNode[]temp = new ListNode[100];
        int index = 0;
        while (head!=null){

            temp[index++] = head;
        }
        return temp[index/2];

    }
}
